Game-Tree Search Using Proof Numbers: The First Twenty Years
نویسندگان
چکیده
منابع مشابه
The B* Tree Search Algorithm: A Best-First Proof Procedure
In this paper we present a new algorithm for searching trees. The algorithm, which we have named B*, finds a proof that an arc at the root of a search tree is better than any other. It does this by attempting to find both the best arc at the root and the simplest proof, in best-first fashion. This strategy determines the order of node expansion. Any node that is expanded is assigned two values:...
متن کاملThe B* Tree Search Algorithm: A Best-First Proof Proceduret
In this paper we present a new algorithm for searching trees. The algorithm, which we have named B*, finds a proof that an arc at the root of a search tree is better than any other. It does this by attempting to find both the best arc at the root and the simplest proof, in best-first fashion. This strategy determines the order of node expansion. Any node that is expanded is assigned two values:...
متن کاملThe First Twenty-Five Years
At the initial meeting of the AES, held in November 1927, among the resolutions passed, two were of particular significance. They were: 1. That the object of this Society be to promote the study and discussion of epidemiological problems. 2. That membership shall consist only of those active and interested in the study of epidemiology. Although the by-laws did not specify that unfinished work c...
متن کاملBoosting Material Modeling Using Game Tree Search
Composition optimization of material is common and costly problem. To avoid redundant measurements, it is effective to expect unknown result by considering previous results. However, the expectation is frequently wrong due to unexpected characteristics inside real materials and it causes local optimum trap. This study presents game tree search can escape from local optimum by limiting the spati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICGA Journal
سال: 2012
ISSN: 1389-6911,2468-2438
DOI: 10.3233/icg-2012-35302